“Hit-and-Run” Transformation by Adenovirus Oncogenes
نویسندگان
چکیده
منابع مشابه
"Hit-and-run" transformation by adenovirus oncogenes.
According to classical concepts of viral oncogenesis, the persistence of virus-specific oncogenes is required to maintain the transformed cellular phenotype. In contrast, the "hit-and-run" hypothesis claims that viruses can mediate cellular transformation through an initial "hit," while maintenance of the transformed state is compatible with the loss ("run") of viral molecules. It is well estab...
متن کاملHit-and-run mixes fast
It is shown that the “hit-and-run” algorithm for sampling from a convex body K (introduced by R.L. Smith) mixes in time O(nR/r), where R and r are the radii of the inscribed and circumscribed balls of K. Thus after appropriate preprocessing, hit-andrun produces an approximately uniformly distributed sample point in time O(n), which matches the best known bound for other sampling algorithms. We ...
متن کاملHit - and - Run Methods Zelda
A comment on Seiford. Journal of Productivity Analysis, 9(3), 279–281. Sarafoglou, N., & Haynes, K. E. (1996). University productivity in Sweden: A demonstration and explanatory analysis for economics and business programs. The Annals of Regional Science, 30, 285–304. Schroeder, R. G. (1973). A survey of management science in university operations. Management Science, 19, 895–906. Seiford, L. M...
متن کاملHit-and-run lymphomagenesis by the Bcl6 oncogene
Diffuse large B-cell lymphoma (DLBCL) is the most common lymphoid malignancy in humans, accounting for nearly 40% of all non-Hodgkin lymphomas. In spite of recent advances in monoclonal antibody therapy, up to 40% of patients eventually relapse and die of their disease after treatment with chemo-immunotherapy regimens. Given the inability to cure many patients with DLBCL, and the significant to...
متن کاملHit - and - Run is Fast and Fun ∗
The hit-and-run algorithm is one of the fastest known methods to generate a random point in a high dimensional convex set. In this paper we study a natural extension of the hit-and-run algorithm to sampling from a logconcave distribution in n dimensions. After appropriate preprocessing, hit-and-run produces a point from approximately the right distribution in amortized time O∗(n3).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Virology
سال: 2001
ISSN: 0022-538X,1098-5514
DOI: 10.1128/jvi.75.7.3089-3094.2001